Labelled domains and automata with concurrency

Concurrency in Timed Automata

Labelled Cayley graphs and minimal automata

Cayley graphs considered as language recognisers are as powerful as the more general finite state automata. This paper applies Cayley graphs to define a class of automata and describe minimal automata of this type, all their congruences and the Nerode equivalence of states. Throughout, the word graph means a finite directed graph without multiple edges but possibly with loops, and D = (V,E) is ...

A Theory of Recursive Domains with Applications to Concurrency ( Extended

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...

Policy Generation for Continuous-time Stochastic Domains with Concurrency

We adopt the framework of Younes, Musliner, & Simmons for planning with concurrency in continuous-time stochastic domains. Our contribution is a set of concrete techniques for policy generation, failure analysis, and repair. These techniques have been implemented in TEMPASTIC, a novel temporal probabilistic planner, and we demonstrate the performance of the planner on two variations of a transp...

A Theory of Recursive Domains with Applications to Concurrency

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on ordertheoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...